<TITLE>prob011: ACC basketball schedule</TITLE>
<HR><!------------------------------------------------------------------------>
<CENTER>
<H1>prob011: ACC basketball schedule</H1>

<TABLE>
<TR> <TD> proposed by
     <TD ALIGN=LEFT> <A HREF="http://www.cs.york.ac.uk/~tw">
          <B>Toby Walsh</B></A> 
          <ADDRESS><a href="mailto:tw@cs.york.ac.uk">
          tw@cs.york.ac.uk</a></ADDRESS>
</TABLE>
</CENTER>
<HR><!------------------------------------------------------------------------>
<H3> Results </H3>

Using explicit enumeration and integer programming and explicit enumeration, 
Nemhauser and Trick report runtimes of the order of 24 hours.

<P> 

Walser reports competitive results using a linear 0-1
formulation and local search methods
in his PhD thesis
(<A HREF="http://ps.uni-sb.de/Papers/abstacts/WalserThesis.html">abstract</A>,
<A HREF="http://www.ps.uni-sb.de/~walser/WalserThesis.ps">postscript</A>,
<A HREF="http://www.ps.uni-sb.de/~walser/WalserThesis.ps.gz">compressed
postscript</A>).

<P>

Henz reports runtimes of less than 1 minute,
using the finite-domain constraint programming tool, 
<A HREF="http://www.comp.nus.edu.sg/~henz/projects/FriarTuck">
Friar Tuck</A>.

<P>


<HR><!------------------------------------------------------------------------>

<UL>

 <A HREF="../../index.html"> Back</A> to CSPLib home page.


